Asymptotically Optimal Size-Interval Task Assignments
نویسندگان
چکیده
منابع مشابه
Asymptotically Optimal Assignments In Ordinal Evaluations of Proposals
In ordinal evaluations of proposals in peer review systems, a set of proposals is assigned to a fixed set of referees so as to maximize the number of pairwise comparisons of proposals under certain referee capacity and proposal subject constraints. In this paper, the following two related problems are considered: (1) Assuming that each referee has a capacity to review k out of n proposals, 2 < ...
متن کاملAsymptotically optimal estimation of smooth functionals for interval
A selection of these reports is available in PostScript form at the Faculty's anonymous ftp-Abstract Estimation in the interval censoring model is considered. A class of smooth functionals is introduced, of which the mean is an example. The asymptotic information lower bound for such functionals can be represented as an inner product of two functions. In case 1, i.e. one observation time per un...
متن کاملAsymptotically Optimal Deterministic Rendezvous
In this paper, we address the deterministic rendezvous in graphs where k mobile agents, disseminated at different times and different nodes, have to meet in finite time at the same node. The mobile agents are autonomous, oblivious, labeled, and move asynchronously. Moreover, we consider an undirected anonymous connected graph. For this problem, we exhibit some asymptotical time and space lower ...
متن کاملAsymptotically optimal Boolean functions
The largest Hamming distance between a Boolean function in $n$ variables and the set of all affine Boolean functions in $n$ variables is known as the covering radius $\rho_n$ of the $[2^n,n+1]$ Reed-Muller code. This number determines how well Boolean functions can be approximated by linear Boolean functions. We prove that \[ \lim_{n\to\infty}2^{n/2}-\rho_n/2^{n/2-1}=1, \] which resolves a conj...
متن کاملAsymptotically optimal block quantization
for the mean-square quantizing error where N is the. number of level&p(x) is the probability density of the input, and E’(x) is the slope of the compressor curve. The formula, an approximation based on the assumption that the number of levels is large and overI& distortion is negligible, is a useful tool for analytical studies of quantfzation. This paper gives a bedstlc argument generallhg Beme...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Parallel and Distributed Systems
سال: 2019
ISSN: 1045-9219,1558-2183,2161-9883
DOI: 10.1109/tpds.2019.2920121